Granularity
نویسنده
چکیده
This paper presents a framework for a theory of granularity, which is seen as a means of constructing simple theories out of more complex ones. A transitive indistinguishability relation can be defined by means of a set of relevant predicates, allowing simplification of a theory of complex phenomena into computationally tractable local theories, or granularities. Nontransitive indistinguishability relations can be characterized in terms of relevant partial predicates, and idealization allows simplification into tractable local theories. Various local theories must be linked with each other by means of articulation axioms, to allow shifts of perspective. Such a treatment of granularity must be built into the very foundation of the reasoning processes of intelligent agents in a complex world.
منابع مشابه
INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کاملOn the Definition of Service Granularity and Its Architectural Impact
Service granularity generally refers to the size of a service. The fact that services should be large-sized or coarse-grained is often postulated as a fundamental design principle of service oriented architecture (SOA). However, multiple meanings are put on the term granularity and the impact of granularity on architectural qualities is not always clear. In order to structure the discussion, we...
متن کاملA top-level categorization of types of granularity
Multiple different understandings and uses exist of what granularity is and how to implement it, where the former influences success of the latter with regards to storing granular data and using granularity for automated reasoning over the data or information, such as granular querying for information retrieval. We propose a taxonomy of types of granularity and discuss for each leaf type how th...
متن کاملA Quantitative Measurement and Validation of Granularity in Service Oriented Architecture
The prominent principle of designing service in Service Oriented Architecture is service granularity. The granularity is a crucial design decision. The service should be neither too coarse nor too fine grained. Therefore it should be evaluated at the design phase itself to measure its level of appropriateness. This paper proposes a suite of metrics for measuring service granularity quantitative...
متن کاملA Computational Framework for Granularity and its Application to Educational Diagnosis
Many artif icial intelligence systems implici t ly use notions of granularity in reasoning, but there is very little research into granularity itself. An exception is the work of Hobbs [1985], which outlines several characteristics of granularity. In this paper we describe an approach to representing granularity which formalizes in computational terms most of Hobbs' notions, often refining and ...
متن کاملMulti-granularity Many-to-many Associative Memory Based on Incidence of Patterns
The present many-to-many associative memory models can not carry out the multi-granularity association. In this paper some many-to-many multi-granularity associative memory models based on incidence of patterns are proposed by use of introducing logic calculation network and granularity control network. The model can control the granularity of output and carry out multi-granularity association.
متن کامل